BayesChess: A computer chess program based on Bayesian networks
نویسندگان
چکیده
منابع مشابه
BayesChess: A computer chess program based on Bayesian networks
In this paper we introduce a chess program able to adapt its game strategy to its opponent, as well as to adapt the evaluation function that guides the search process according to its playing experience. The adaptive and learning abilities have been implemented through Bayesian networks. We show how the program learns through an experiment consisting on a series of games that point out that the...
متن کاملTest Automation based on Computer Chess Principles
Automotive transmission systems are difficult to test and validate, due to the complex interaction of mechanics, hydraulics, electronics, and transmission control software. The tight interaction among an ever increasing amount of software functions and hardware subsystems leads to a new kind of complexity that is difficult to manage during mechatronic design. System tests have to consider huge ...
متن کاملParallelizing a Simple Chess Program
In a closely watched match in 1997, the parallel chess supercomputer Deep Blue defeated then world champion Garry Kasparov 3 12 to 2 1 2 . The fruits of Moore’s law combined with steadily improving chess algorithms now allow programs such as Deep Fritz to challenge human grandmasters while running on nothing more than a commodity 4-way SMP workstation. This paper provides a short overview of th...
متن کاملA Fully Distributed Chess Program
We show how to implement the-enhancements like iterative deepening, transposition tables, history tables etc. used in sequential chess programs in a distributed system such that the distributed algorithm proots by these heuristics as well as the sequential does. Moreover the methods we describe are suitable for very large distributed systems. We implemented these-enhancements in the distributed...
متن کاملThe Technology Chess Program
A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a brute force search of the move tree with no forward pruning, using material as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal. Because of the transparent structure, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2008
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2007.06.013